Graph models and their efficient implementation for sparse Jacobian matrix determination
نویسندگان
چکیده
منابع مشابه
Optimal direct determination of sparse Jacobian matrices
It is well known that a sparse Jacobian matrix can be determined with fewer function evaluations or automatic differentiation passes than the number of independent variables of the underlying function. In this paper we show that by grouping together rows into blocks one can reduce this number further. We propose a graph coloring technique for row partitioned Jacobian matrices to efficiently det...
متن کاملGeneric Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent graph abstractions. Recently, generic ...
متن کاملSparse Matrix Decompositions and Graph Characterizations
Zeros in positive definite correlation matrices arise frequently in probability and statistics, and are intimately related to the notion of stochastic independence. The question of when zeros (i.e., sparsity) in a positive definite matrix A are preserved in its Cholesky decomposition, and vice versa, was addressed by Paulsen et al. [19] [see Journal of Functional Analysis, 85, 151-178]. In part...
متن کاملSparse Matrix Implementation in Octave
This paper discusses the implementation of the sparse matrix support with Octave. It address the algorithms that have been used, their implementation, including examples of using sparse matrices in scripts and in dynamically linked code. The octave sparse functions the compared with their equivalent functions with Matlab, and benchmark timings are calculated.
متن کاملThe Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bicoloring, to exploit the sparsity of the Jacobian matrix J and thereby allow for the efficient determination of J using AD software. We analyze both a direct scheme and a substitution p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.12.010